wanyu/IteraTeR_v2 huggingface dataset:
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap %DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: fluency
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: coherence
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: fluency
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { %DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: fluency
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner,\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: fluency
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { %DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: fluency
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner,\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: fluency
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, and { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: coherence
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { %DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: fluency
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% %DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Edit intent: coherence
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner,\ulcorner\urcorner } -
Edit intent: fluency
Original:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner },  { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner } -
Revised:  We then give a characterization and polytime recognition algorithm for special subclasses of Split \cap L%DIFDELCMD < ]%%% . We also consider the natural subclasses of B_1-EPG formed by the subsets of the four single bend shapes (i.e., { L \llcorner }, { L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner }, { L,%DIFDELCMD < \rceil%%% \llcorner\urcorner }, { L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner,\urcorner } -
Edit intent: fluency
Original:  note[\llcorner][\llcorner\ulcorner][\llcorner\urcorner][\llcorner\ulcorner\urcorner]  : all other subsets are isomorphic to these up to 90 degree rotation ).
Revised:  note[\llcorner],[\llcorner\ulcorner][\llcorner\urcorner][\llcorner\ulcorner\urcorner] : all other subsets are isomorphic to these up to 90 degree rotation ).
Edit intent: fluency
Original:  note[\llcorner][\llcorner\ulcorner][\llcorner\urcorner][\llcorner\ulcorner\urcorner]  : all other subsets are isomorphic to these up to 90 degree rotation ).
Revised:  note[\llcorner][\llcorner\ulcorner],[\llcorner\urcorner][\llcorner\ulcorner\urcorner] : all other subsets are isomorphic to these up to 90 degree rotation ).
Edit intent: fluency
Original:  note[\llcorner][\llcorner\ulcorner][\llcorner\urcorner][\llcorner\ulcorner\urcorner]  : all other subsets are isomorphic to these up to 90 degree rotation ).
Revised:  note[\llcorner][\llcorner\ulcorner][\llcorner\urcorner], and[\llcorner\ulcorner\urcorner] : all other subsets are isomorphic to these up to 90 degree rotation ).
Edit intent: coherence
Original:  note[\llcorner][\llcorner\ulcorner][\llcorner\urcorner][\llcorner\ulcorner\urcorner]  : all other subsets are isomorphic to these up to 90 degree rotation ).
Revised:  note[\llcorner][\llcorner\ulcorner][\llcorner\urcorner][\llcorner,\ulcorner\urcorner] : all other subsets are isomorphic to these up to 90 degree rotation ).
Edit intent: fluency
Original:  note[\llcorner][\llcorner\ulcorner][\llcorner\urcorner][\llcorner\ulcorner\urcorner]  : all other subsets are isomorphic to these up to 90 degree rotation ).
Revised:  note[\llcorner][\llcorner\ulcorner][\llcorner\urcorner][\llcorner\ulcorner,\urcorner] : all other subsets are isomorphic to these up to 90 degree rotation ).
Edit intent: coherence
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Edit intent: fluency
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ %DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Edit intent: fluency
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner,\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Edit intent: fluency
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ %DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Edit intent: fluency
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner,\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Edit intent: fluency
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ %DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Edit intent: fluency
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% %DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Edit intent: coherence
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner,\ulcorner\urcorner ] \subsetneq B_1-EPG;
Edit intent: fluency
Original:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner\urcorner ] \subsetneq B_1-EPG;
Revised:  We observe the expected strict inclusions and incomparability (i.e., [ L \llcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ], [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ] \subsetneq [ L,%DIFDELCMD < \lceil%%% ,%DIFDELCMD < \rceil%%% \llcorner\ulcorner,\urcorner ] \subsetneq B_1-EPG;
Edit intent: fluency
Original:  also, [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ] is incomparable with [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ]) [\llcorner] .
Revised:  also, [ %DIFDELCMD < \lceil%%% \llcorner\ulcorner ] is incomparable with [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ]) [\llcorner] .
Edit intent: fluency
Original:  also, [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ] is incomparable with [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ]) [\llcorner] .
Revised:  also, [ L,%DIFDELCMD < \lceil%%% \llcorner,\ulcorner ] is incomparable with [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ]) [\llcorner] .
Edit intent: fluency
Original:  also, [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ] is incomparable with [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ]) [\llcorner] .
Revised:  also, [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ] is incomparable with [ %DIFDELCMD < \rceil%%% \llcorner\urcorner ]) [\llcorner] .
Edit intent: fluency
Original:  also, [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ] is incomparable with [ L,%DIFDELCMD < \rceil%%% \llcorner\urcorner ]) [\llcorner] .
Revised:  also, [ L,%DIFDELCMD < \lceil%%% \llcorner\ulcorner ] is incomparable with [ L,%DIFDELCMD < \rceil%%% \llcorner,\urcorner ]) [\llcorner] .
Edit intent: fluency
Original: Synthesis of proteins is one of the most fundamental biological processes, which consumes a significant amount of cellular resources.
Revised: Protein synthesis is one of the most fundamental biological processes, which consumes a significant amount of cellular resources.
Edit intent: clarity
Original:  We build such a model by lumping multiple states of translated mRNA into few dynamical variables and introducing a pool of translating ribosomes.
Revised:  We build such a model by lumping multiple states of translated mRNA into few dynamical variables and by introducing a variable describing the pool of translating ribosomes.
Edit intent: clarity
Original:  Then, traditionally, the evolutionary dynamics is studied in the limit  vanishing mutational step sizes.
Revised:  Then, traditionally, the evolutionary dynamics is studied in the limit of vanishing mutational step sizes.
Edit intent: fluency
Original:  By means of theoretical analysis  as well as computer simulations, we demonstrate how distinct, small non-null, mutational steps affect the patterns of evolutionary branching.
Revised:  By means of theoretical analysis as well as computer simulations, we demonstrate how discrete mutational steps affect the patterns of evolutionary branching.
Edit intent: clarity
Original:  The resulting algorithm represents a significant breakthrough in the practical computation of distance on a wide variety of geometric domains, since these problems can be prefactored once and subsequently solved in linear time.
Revised:  The method represents a significant breakthrough in the practical computation of distance on a wide variety of geometric domains, since these problems can be prefactored once and subsequently solved in linear time.
Edit intent: clarity
Original:  The resulting algorithm represents a significant breakthrough in the practical computation of distance on a wide variety of geometric domains, since these problems can be prefactored once and subsequently solved in linear time.
Revised:  The resulting algorithm represents a significant breakthrough in the practical computation of distance on a wide variety of geometric domains, since the resulting linear systems can be prefactored once and subsequently solved in linear time.
Edit intent: clarity
Original:  The resulting algorithm represents a significant breakthrough in the practical computation of distance on a wide variety of geometric domains, since these problems can be prefactored once and subsequently solved in linear time.
Revised:  The resulting algorithm represents a significant breakthrough in the practical computation of distance on a wide variety of geometric domains, since these problems can be prefactored once and subsequently solved in near-linear time.
Edit intent: clarity
Original: The conception of multi-alphabetical genetics is considered .
Revised: The conception of multi-alphabetical genetics is represented .
Edit intent: clarity
Original:  Matrix forms of the representation of the multi-level system of molecular-genetic alphabets have discovered algebraic properties of this system.
Revised:  Matrix forms of the representation of the multi-level system of molecular-genetic alphabets have revealed algebraic properties of this system.
Edit intent: clarity
Original:  A possibility of new approach for modelling genetically inherited phenomena of biological spirals and phyllotaxis laws on the base of screw theory and Fibonacci matrices is noted . Dyadic trees for  the whole human genome are constructed.
Revised:  A possibility of new approach is mentioned to simulate genetically inherited phenomena of biological spirals and phyllotaxis laws on the base of screw theory and Fibonacci matrices is noted . Dyadic trees for the whole human genome are constructed.
Edit intent: clarity
Original:  A possibility of new approach for modelling genetically inherited phenomena of biological spirals and phyllotaxis laws on the base of screw theory and Fibonacci matrices is noted . Dyadic trees for  the whole human genome are constructed.
Revised:  A possibility of new approach for modelling genetically inherited phenomena of biological spirals and phyllotaxis laws on the base of screw theory and Fibonacci matrices . Dyadic trees for the whole human genome are constructed.
Edit intent: coherence