<gh_stars>0
#
# Copyright © 2022 <NAME>, <NAME>, <NAME>,
#                  <NAME>, <NAME>
#
# Permission is hereby granted, free of charge, to any person obtaining a copy of
# this software and associated documentation files (the “Software”), to deal in
# the Software without restriction, including without limitation the rights to
# use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
# of the Software, and to permit persons to whom the Software is furnished to do
# so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
#
def consecutive_pairalign(reversed_part, identical_part):
    count = 0
    lrev = len(reversed_part)
    no_iter = min(len(reversed_part), len(identical_part))
    i = 0
    for i in range(0, no_iter):
        if (reversed_part[lrev - i - 1] + identical_part[i]) in [
            "au",
            "ua",
            "gc",
            "cg",
            "ug",
            "gu",
        ]:
            count += 1
        else:
            break
    return (lrev - count, i), (
        reversed_part[lrev - count :],
        identical_part[:count],
    )  # noqa
